Inexact graph matching using genetic search
نویسندگان
چکیده
منابع مشابه
Inexact graph matching using genetic search
-This paper describes a framework for performing relational graph matching using genetic search. There are three novel ingredients to the work. Firstly, we cast the optimisation process into a Bayesian framework by exploiting the recently reported global consistency measure of Wilson and Hancock as a fitness measure. The second novel idea is to realise the crossover process at the level of subg...
متن کاملInexact graph matching using a genetic algorithm for image recognition
Exact graph matching using a genetic algorithm for image recognition has been introduced in previously published work. The algorithm was based on angle matching between two given graphs. It has proven to be quite effective in exact graph matching. However, the algorithm needs some modifications in order to handle cases where the number of nodes, shapes and rotations of the two graphs are differ...
متن کاملInexact Graph Matching Using Symbolic Constraints
Relational graphs are a fundamental type of scene representation for medium and high level computer vision tasks. They provide a generic way of encoding entities and relationships. The comparison and matching of such graphs is an important and challenging problem under the conditions of uncertainty and corruption which exist in most vision problems. In this thesis a method for matching relation...
متن کاملG A New Genetic Algorithm Applied to Inexact Graph Matching
Graph matching is used for model-based pattern recognition of brain images, model design objects in a computeraided design, machine learning, data mining, packet filtering, web phishing, etc. In this paper, we have proposed a new genetic algorithm for inextract graph matching with many types of graph such as undirected, directed, weighted, and labeled. The experimental results show that our pro...
متن کاملShape Retrieval by Inexact Graph Matching
This paper describes a graph-matching technique for recognising line-pattern shapes in large image databases. The methodological contribution of the paper is to develop a Bayesian matching algorithm that uses edge-consistency and node attribute similarity. This information is used to determine the a posteriori probability of a query graph for each of the candidate matches in the database. The n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 1997
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(96)00123-9